Independence-friendly logic and axiomatic set theory
نویسندگان
چکیده
منابع مشابه
Independence-friendly cylindric set algebras
Independence-friendly logic is a conservative extension of first-order logic that has the same expressive power as existential second-order logic. In her Ph.D. thesis, Dechesne introduces a variant of independence-friendly logic called IFG logic. We attempt to algebraize IFG logic in the same way that Boolean algebra is the algebra of propositional logic and cylindric algebra is the algebra of ...
متن کاملAxiomatic set theory
Elementary set theory can be studied informally and intuitively, and so can be taught in primary schools using, say, Venn diagrams. The intuitive approach silently assumes that all objects in the universe of discourse satisfying any defining condition form a set. This assumption gives rise to antinomies, the simplest and best known of which being Russell's paradox. Axiomatic set theory was orig...
متن کاملAxiomatic Set Theory
Lecture 1, 07.03.: We made a review of the material covered in Chapter I of [3], up to Theorem I.9.11 (Transfinite Recursion on Well-founded Relations). Lecture 2, 14.03.: We discussed the notion of a rank, as well as the Mostowski collapsing function material corresponding to Section 9 of [3]. Lecture 3, 04.04.: We discussed hereditarily transitive sets, the DownwardLöwenheim-Skolem-Tarksi The...
متن کاملApproaches to Independence Friendly Modal Logic
The aim of the present paper is to discuss two different approaches for formulating independence friendly (IF) modal logic. In one of them, the language of basic modal logic is enriched with the slash notation familiar from IF first-order logics, and the resulting logic is interpreted in terms of games and uniform strategies. A different approach is formulated in the present paper: an IF modal ...
متن کاملThe Complexity of Independence-Friendly Fixpoint Logic
We study the complexity of model-checking for the fixpoint extension of Hintikka and Sandu’s independence-friendly logic. We show that this logic captures ExpTime; and by embedding PFP, we show that its combined complexity is ExpSpace-hard, and moreover the logic includes second order logic (on finite structures).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2004
ISSN: 0168-0072
DOI: 10.1016/j.apal.2003.11.006